Search results for "Range query"

showing 3 items of 3 documents

Hyperion

2019

Indexes are essential in data management systems to increase the speed of data retrievals. Widespread data structures to provide fast and memory-efficient indexes are prefix tries. Implementations like Judy, ART, or HOT optimize their internal alignments for cache and vector unit efficiency. While these measures usually improve the performance substantially, they can have a negative impact on memory efficiency. In this paper we present Hyperion, a trie-based main-memory key-value store achieving extreme space efficiency. In contrast to other data structures, Hyperion does not depend on CPU vector units, but scans the data structure linearly. Combined with a custom memory allocator, Hyperion…

0303 health sciencesRange query (data structures)Computer scienceData structurecomputer.software_genreSearch tree03 medical and health sciencesMemory managementTrieMemory footprintData miningCachecomputer030304 developmental biologyProceedings of the 2019 International Conference on Management of Data
researchProduct

A Two-layer Partitioning for Non-point Spatial Data

2021

Non-point spatial objects (e.g., polygons, linestrings, etc.) are ubiquitous and their effective management is always timely. We study the problem of indexing non-point objects in memory. We propose a secondary partitioning technique for space-oriented partitioning indices (e.g., grids), which improves their performance significantly, by avoiding the generation and elimination of duplicate results. Our approach is novel and of a high impact, as (i) it is extremely easy to implement and (ii) it can be used by any space-partitioning index. We show how our approach can be used to boost the performance of spatial range queries. We also show how we can avoid performing the expensive refinement s…

Information engineeringDistributed databaseRange query (data structures)Computer scienceSearch engine indexingScalabilityTwo layerPoint (geometry)Data miningcomputer.software_genreSpatial analysiscomputer
researchProduct

A data aggregation strategy based on wavelet for the internet of things

2017

The advent of emerging information and communication technologies, such as RFID, small size sensors and sensor networks, has made accessible a huge amount of information that requires sophisticated and efficient search algorithms to support queries on that data. In this paper we focus on the problem of aggregating data collected from these devices to efficiently support queries, inferences or statistics on them. In general, data aggregation techniques are necessary to efficiently collect information in a compact and cost-effective way. Some current solutions try to meet the above criteria, by exploiting different data aggregation techniques, for instance BitVector or Q_Digest. In this manus…

IoTExploitRange query (data structures)Computer science0102 computer and information sciences02 engineering and technologyFog Computingcomputer.software_genre01 natural sciencesWaveletSoftwareSearch algorithmHistogramComputational Theory and Mathematic0202 electrical engineering electronic engineering information engineeringP2PSettore INF/01 - Informaticabusiness.industry020206 networking & telecommunicationsData aggregation; Fog Computing; IoT; P2P; Range query; WaveletData aggregationData aggregator010201 computation theory & mathematicsComputational MathematicRange queryData miningbusinesscomputerWireless sensor networkWaveletSoftware
researchProduct